On a Conjecture of Helleseth
نویسندگان
چکیده
We are concern about a conjecture proposed in the middle of the seventies by Hellesseth in the framework of maximal sequences and theirs crosscorrelations. The conjecture claims the existence of a zero outphase Fourier coefficient. We give some divisibility properties in this direction. 1. Two conjectures of Helleseth Let L be a finite field of order q > 2 and characteristic p. Let μ be the canonical additive character of L i.e. μ(x) = exp(2iπTr (x)/p) where Tr is the trace function with respect to the finite field extension L/Fp. The Fourier coefficient of a mapping f : L → L is defined at a ∈ L by (1) f̂(a) = ∑ x∈L μ(ax+ f(x)). The distribution of these values is called the Fourier spectrum of f . Note that when f is a permutation the phase Fourier coefficient f̂(0) is equal to 0. The mapping f(x) = x is called the power function of exponent s, and it is a permutation if and only if (s, q − 1) = 1. Moreover, if s ≡ 1 mod (p − 1) the Fourier coefficients of f are rational integers. Helleseth made in [3] two “global” conjectures on the spectra of power permutations. The first claims the vanishing of the quantity (related to Dedekind determinant, see [9]) (2) D(f) = ∏
منابع مشابه
Proof of a Conjecture of Helleseth: Maximal Linear Recursive Sequences of Period 22n-1 Never Have Three-Valued Cross-Correlation
We prove a conjecture of Helleseth that claims that for any n ≥ 0, a pair of binary maximal linear sequences of period 22 n −1 can not have a three-valued cross-correlation function.
متن کاملar X iv : c s / 06 08 12 3 v 1 [ cs . I T ] 3 1 A ug 2 00 6 Proof of a Conjecture of Helleseth Regarding Pairs of Binary m - Sequences ∗
–Binary m-sequences are maximal length sequences generated by shift registers of length m, that are employed in navigation, radar, and spread-spectrum communication. It is well known that given a pair of distinct m-sequences, the crosscorrelation function must take on at least three values. This correspondence shows the three correlation values are symmetric about -1. The main result is a proof...
متن کاملThe Proof of Lin's Conjecture via the Decimation-Hadamard Transform
In 1998, Lin presented a conjecture on a class of ternary sequences with ideal 2-level autocorrelation in his Ph.D thesis. Those sequences have a very simple structure, i.e., their trace representation has two trace monomial terms. In this paper, we present a proof for the conjecture. The mathematical tools employed are the second-order multiplexing decimation-Hadamard transform, Stickelberger’...
متن کاملOn some generalisations of Brown's conjecture
Let $P$ be a complex polynomial of the form $P(z)=zdisplaystyleprod_{k=1}^{n-1}(z-z_{k})$,where $|z_k|ge 1,1le kle n-1$ then $ P^prime(z)ne 0$. If $|z|
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013